Global Topology Concept Neighborhood Graph and Its Application in Topological Similarity Measurement
نویسندگان
چکیده
Abstract A topological relationship is a key factor in the spatial data processing. Aiming at problem of similarity measurement when dimension objects changes process map generalization, this paper proposes method based on global concept neighborhood graph. Firstly, all relationships that can be described by nine intersection model are abstracted, generalized, and classified, classified point/point, point/line, point/polygon, line/line, line/polygon, polygon/polygon local graphs established. Then, according to generalization rules, mapping between different types established, graph obtained, Finally, morphological measured. The experimental results show proposed better meet shape changes.
منابع مشابه
The Common Neighborhood Graph and Its Energy
Let $G$ be a simple graph with vertex set ${v_1,v_2,ldots,v_n}$. The common neighborhood graph (congraph) of $G$, denoted by $con(G)$, is the graph with vertex set ${v_1,v_2,ldots,v_n}$, in which two vertices are adjacent if and only they have at least one common neighbor in the graph $G$. The basic properties of $con(G)$ and of its energy are established.
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملCommon Neighborhood Graph
Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملApplication of Graph Theory to Some Thermodynamic Properties and Topological Indices
The relationship between the Randic , Wiener, Hosoya , Balaban, Schultz indices, Harary numbers andDistance matrix to enthalpies of formation (Airf), heat capacity, (Cp) , enthalpies of combustion (AH °c ),enthalpy of vaporization (AH °vap) and normal boiling points (bpK)of C2 C10 normal alkanes isrepresented
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2023
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/2449/1/012017